Multilevel framework for large-scale global optimization

نویسندگان

  • Sedigheh Mahdavi
  • Shahryar Rahnamayan
  • Mohammad Ebrahim Shiri
چکیده

Large-scale global optimization (LSGO) algorithms are crucially important to handle real-world problems. Recently, cooperative co-evolution (CC) algorithms have successfully been applied for solving many large-scale practical problems. Many applications have imbalanced subcomponents where the size of subcomponents and their contribution to the objective function value are different. CC algorithms often lose their efficiency on LSGO problems with the imbalanced subcomponents; since they do not consider the imbalance aspect of variables. In this paper, we propose a multilevel optimization framework based on variables effect (called MOFBVE) which optimizes several subcomponents of the most important variables at earlier stages of optimization procedure before optimizing the problemwith the original search space at its last stage. Sensitivity analysis (SA) method determines how the variation in the outputs of the model can be influenced by the variation of its input parameters. MOFBVE computes the main effect of variables using an SA method, Morris screening, and then it employs the k-means clustering method to construct groups including variables with the similar effects on the fitness value. The constructed groups are sorted in the descending order based on their contribution on the fitness value and Communicated by V. Loia. B Shahryar Rahnamayan [email protected] Sedigheh Mahdavi [email protected] 1 Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran 2 Department of Electrical, Computer, and Software Engineering, University of Ontario Institute of Technology (UOIT), 2000 Simcoe Street North, Oshawa, ON L1H 7K4, Canada the top groups are selected as the levels of the important variables. MOFBVE can reduce the complexity of search space to work with a simplified model to achieve an efficient exploration. The performance of MOFBVE is benchmarked on the imbalanced LSGO problems, i.e., two individually modified CEC-2010 and the CEC-2013 LSGO benchmark functions. The simulated experiments confirmed that MOFBVE obtains a promising performance on the majority of the imbalanced LSGO test functions. Also, MOFBVE is compared with state-of-the-art CC algorithms; and the results show that it is better than or at least comparable to CC algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION

In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...

متن کامل

A limited memory adaptive trust-region approach for large-scale unconstrained optimization

This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...

متن کامل

CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization

Large-scale problems are nonlinear problems that need metaheuristics, or global optimization algorithms. This paper reviews nature-inspired metaheuristics, then it introduces a framework named Competitive Ant Colony Optimization inspired by the chemical communications among insects. Then a case study is presented to investigate the proposed framework for large-scale global optimization.

متن کامل

A Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations

Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...

متن کامل

Fast Multilevel Support Vector Machines

Solving different types of optimization models (including parameters fitting) for support vector machines on largescale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training set in one optimization process, the support vectors are obtained and gradually...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Soft Comput.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2017